#实现冒泡和快速排序算法的实现
#下面是泡泡
list_ture = []
for number in range(1,11):
    list1 = int(input('数字'+str(number)))
    list_ture.append(list1)
i=0
len1 = len(list_ture)
leicun = 0
for i in range(1,len1-1):
    j=0
    while j<len1-i-1: #由于i从1开始，需要减一才能从第一个开始选择
        if list_ture[j]>list_ture[j+1]:
            leicun=list_ture[j]
            list_ture[j]=list_ture[j+1]
            list_ture[j+1]=leicun
        j+=1
print("排序后：")
for x in list_ture:
    print(x,end=' ')
#快速排列我看不懂，没写了